MINIMAX INVERSE THEOREMS IN DYNAMIC PROGRAMMING
نویسندگان
چکیده
منابع مشابه
Envelope Theorems in Dynamic Programming
The Envelope Theorem is a statement about derivatives along an optimal trajectory. In Dynamic Programming the Envelope Theorem can be used to characterize and compute the Optimal Value Function from its derivatives. We illustrate this here for the Linear-Quadratic Control Problem, the Resource Allocation Problem, and the Inverse Problem of Dynamic Programming.
متن کاملMinimax Theorems
We suppose that X and Y are nonempty sets and f : X × Y → R. A minimax theorem is a theorem that asserts that, under certain conditions , inf Y sup X f = sup X inf Y f, that is to say, inf y∈Y sup x∈X f (x, y) = sup x∈X inf y∈Y f (x, y). The purpose of this article is to give the reader the flavor of the different kind of mini-max theorems, and of the techniques that have been used to prove the...
متن کاملMinimax Theorems in Probabilistic Metric Spaces
The minimax problem is of fundamental importance in nonlinear analysis and, especially, plays an important role in mathematical economics and game theory. The purpose of this paper is to obtain some minimax theorems for mixed lowerupper semi-continuous functions in probabilistic metric spaces which extend the minimax theorems of von Neumann types [1, 3, 4, 5, 6, 8, 10, 11, 12]. As applications,...
متن کاملMinimax differential dynamic programming: application to a biped walking robot
We have developed a robust control policy design method for high-dimensional state spaces by using differential dynamic programming with a minimax criterion. As an example, we applied our method to a simulated five link biped robot. The results show lower joint torques using the optimal control policy compared to torques generated by a hand-tuned PD servo controller. Results also show that the ...
متن کاملMinimax Differential Dynamic Programming: An Application to Robust Biped Walking
We developed a robust control policy design method in high-dimensional state space by using differential dynamic programming with a minimax criterion. As an example, we applied our method to a simulated five link biped robot. The results show lower joint torques from the optimal control policy compared to a hand-tuned PD servo controller. Results also show that the simulated biped robot can suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Statistics
سال: 1976
ISSN: 0007-4993
DOI: 10.5109/13107